Control theory for principled heap sizing
نویسندگان
چکیده
منابع مشابه
An Equation-Based Heap Sizing RuleI
For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to automatically de-allocate objects that are no longer needed by the applications. However, there is a run-time performance overhead in garbage collection, and this cost is sensitive to heap size H : a smaller H will trigger m...
متن کاملAutomated Heap Sizing in the Poly / ML Runtime ( Position Paper )
Typical theorem-proving workloads on the Poly/ML runtime may execute for several hours, occupying multi-gigabyte heaps. The runtime heap size may be fixed at execution startup time, or it may be allowed to vary dynamically. To date, runtime heap size growth has been implemented using simple hard-coded heuristics. In this position paper, we argue that a mathematically rigorous approach to heap s...
متن کاملWe are all Economists Now
Multiple virtual machine (VM) workloads are increasingly common, given the growth of managed enterprise application systems and consolidated virtual servers. Until now, there has been no principled approach to partitioning memory resource between multiple co-located VMs. In this paper, we develop a general framework for multi-VM heap sizing, based on the principle of utility maximization from m...
متن کاملHeap Models, Composition and Control
This chapter deals with modelling and control of discrete event systems. Discrete event systems (DES) are event driven man made systems whose evolution is guided by occurrences of asynchronous events as opposed to classical time driven discrete or continuous systems. DES are modelled by tools from computer science like automata, Petri nets and process algebras. There are two major streams in co...
متن کاملTowards a Principled Theory of Clustering
To answer the question “Which clustering function should one use?” for a given task, we consider an axiomatic approach to the theory of Clustering, with special focus on uniqueness theorems characterizing popular clustering functions. We argue that such theorems can be used to decide exactly when a particular clustering function should be used or avoided. We discuss abstract properties of clust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2555670.2466481